class Solution:
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        # using binary search

        len1 = len(nums1)
        len2 = len(nums2)
        start1 = 0
        start2 = 0
        end1 = len1 - 1
        end2 = len2 - 1
        i1 = 0
        i2 = 0

        while True:
            i1 = (start1 + end1) // 2
            i2 = (start2 + end2) // 2
            if nums1[i1] > nums2[i2]:
                pass
